OAL: an Implementation of an Actor Language on a Massively Parallel Message-Passing Architecture
نویسندگان
چکیده
We study the implementation of an actor language, OAL, on a massively parallel message-passing architecture: MEGA. Motivations and implementation constraints are exposed. A simulator has been built to investigate resource consumption. First results sbow the feasibility o f the implementation but indicates serious problems in memory usage. Load-balancing strategies are presented which partially solve the memory problem. Actors adequacy as a model f o r exploiting massive parallelism is discussed in conclusion.
منابع مشابه
An Object-oriented Implementation Model for the Promoter Language Technical Report
The PROMOTER programming language is designated for data parallel applications that are to run on massively parallel computers with distributed memory. This paper presents an object-oriented implementation model for the PROMOTER language. An object-oriented approach to compile data-parallel programs to message passing programs can reduce design complexity, facilitate reuse of components, and ea...
متن کاملHAL: A High-Level Actor Language and Its Distributed Implementation
We describe Hal, a high-level, actor-based language which has served as a test-bed for experimenting with powerful linguistic constructs for parallel and distributed programming. Hal is an architecture independent, concurrent object-oriented language which supports inheritance, synchronization constraints, continuation capture, synchronous and asynchronous message passing, and re ection. The Ha...
متن کاملParallel Programming and Complexity Analysis using Actors
We describe Actors, a exible, scalable and eÆcient model of computation, and develop a framework for analyzing the parallel complexity of programs written in it. Actors are asynchronous, autonomous objects which interact by message-passing. The data and process decomposition inherent in Actors simpli es modeling realworld systems. High-level concurrent programming abstractions have been develop...
متن کاملPrediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The program can be used to routinely fold RNA sequences of more than 10,000 nucleotides. Applications to complete viral genomes are discussed.
متن کاملLow level Architecture - independence of Glasgow ParallelHaskell ( GpH )
In principle, pure functional languages promise straightforward architecture-independent parallelism. We investigate the validity of this claim in the context of our highly-portable implementation of an implicitly-parallel functional language: the GUM implementation of Glasgow Parallel Haskell (GpH). We focus here on the low-level architecture independence of GUM: the high-level architecture in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991